Methods for Competitive Co-Evolution: Finding Opponents Worth Beating
نویسندگان
چکیده
Co-evolution refers to the simultaneous evolution of two or more genetically distinct populations with coupled tness landscapes. In this paper we consider \competitive co-evolution," in which the tness of an individual in a \host" population is based on direct competition with individual(s) from a \parasite" population. Competitive co-evolution is applied to three game-learning problems: Tic-Tac-Toe (TTT), Nim and a small version of Go. Two new techniques in competitive co-evolution are explored. \Competitive tness sharing" changes the way tness is measured, and \shared sampling" alters the way parasites are chosen for testing hosts. Experiments using TTT and Nim show a substantial improvement in performance when these methods are used. Preliminary results using co-evolution for the discovery of cellular automata rules for playing Go are presented .
منابع مشابه
Methods for Competitive Co - evolution : Finding Opponents Worth
Co-evolution refers to the simultaneous evolution of two or more genetically distinct populations with coupled tness landscapes. In this paper we consider \competitive co-evolution," in which the tness of an individual in a \host" population is based on direct competition with individual(s) from a \par-asite" population. Competitive co-evolution is applied to three game-learning problems: Tic-T...
متن کاملAlgorithms for Evolving No-Limit Texas Hold'em Poker Playing Agents
Computers have difficulty learning how to play Texas Hold’em Poker. The game contains a high degree of stochasticity, hidden information, and opponents that are deliberately trying to mis-represent their current state. Poker has a much larger game space than classic parlour games such as Chess and Backgammon. Evolutionary methods have been shown to find relatively good results in large state sp...
متن کاملVisualising Co-evolution with CIAO Plots
In a previous paper [2], we introduced a number of visualization techniques that we had developed for monitoring the dynamics of artificial competitive co-evolutionary systems. One of these techniques involves evaluating the performance of an individual from the current population in a series of trials against opponents from all previous generations, and visualizing the results as a 2-d grid of...
متن کاملNeuro-Evolution in Multi-Player Pente
Pente is a derivative of the Japanese game Go-moku, both of which are normally played with only two players. We extend the game of Pente to three players and study the ability of neuro-evolution via the Enforced Sub-Populations (ESP) algorithm to evolve Pente players for 7 by 7 boards capable of beating pairs of opponents taken from a set of five simple handcoded opponents. We also compare the ...
متن کاملMultiobjective Imperialist Competitive Evolutionary Algorithm for Solving Nonlinear Constrained Programming Problems
Nonlinear constrained programing problem (NCPP) has been arisen in diverse range of sciences such as portfolio, economic management etc.. In this paper, a multiobjective imperialist competitive evolutionary algorithm for solving NCPP is proposed. Firstly, we transform the NCPP into a biobjective optimization problem. Secondly, in order to improve the diversity of evolution country swarm, and he...
متن کامل